Unfolding Grammars in Adhesive Categories
نویسندگان
چکیده
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the abstract setting of (single pushout) rewriting over adhesive categories. The unfolding construction is characterized as a coreflection, i.e. the unfolding functor arises as the right adjoint to the embedding of the category of occurrence grammars into the category of grammars. As the unfolding represents potentially infinite computations, we need to work in adhesive categories with “well-behaved” colimits of ω-chains of monomorphisms. Compared to previous work on the unfolding of Petri nets and graph grammars, our results apply to a wider class of systems, which is due to the use of a refined notion of grammar morphism.
منابع مشابه
A category theoretical approach to the concurrent semantics of rewriting: adhesive categories and related concepts
This thesis studies formal semantics for a family of rewriting formalisms that have arisen as category theoretical abstractions of the so-called algebraic approaches to graph rewriting. The latter in turn generalize and combine features of term rewriting and Petri nets. Two salient features of (the abstract versions of) graph rewriting are a suitable class of categories which captures the struc...
متن کاملTowards Secrecy for Rewriting in Weakly Adhesive Categories
Inspired by the scope extrusion phenomenon of name passing calculi that allow to reason about knowledge of (secret) names, we propose an abstract formulation of the concept of secret in any weakly adhesive category. The guiding idea is to mark part of a system state as visible or publicly accessible; further, in principle, something that has become public knowledge will stay accessible indefini...
متن کاملAbstract True Concurrency: Adhesive Processes
True Concurrency: Adhesive Processes Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, and Pawe l Sobociński 1 Dipartimento di Informatica, Università Ca’ Foscari di Venezia, Italy 2 Dipartimento di Informatica, Università di Pisa, Italy 3 Institut für Formale Methoden der Informatik, Universität Stuttgart, Germany 4 Computer Laboratory, University of Cambridge, United Kingdom Abst...
متن کاملProcesses for Adhesive Rewriting Systems
Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, including various modelling frameworks for concurrent and distributed systems. Here we begin the development of a truly concurrent semantics for adhesive rewriting systems by defining the fundamental notion of process, well-known fro...
متن کاملUnfolding of Double-pushout Graph Grammars Is a Coreeection ?
In a recent paper, mimicking Winskel's construction for Petri nets, a concurrent semantics for (double-pushout) DPO graph grammars has been provided by showing that each graph grammar can be unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar. This paper faces the problem of p...
متن کامل